منابع مشابه
Closing in on Time and Space Optimal Construction of Compressed Indexes
Fast and space-efficient construction of compressed indexes such as compressed suffix array (CSA) and compressed suffix tree (CST) has been a major open problem until recently, when Belazzougui [STOC 2014] described an algorithm able to build both of these data structures in O(n) (randomized; later improved by the same author to deterministic) time and O(n/ log σ n) words of space, where n is t...
متن کاملFast Compressed Self-Indexes with Deterministic Linear-Time Construction
We introduce a compressed suffix array representation that, on a text T of length n over an alphabet of size σ, can be built in O(n) deterministic time, within O(n log σ) bits of working space, and counts the number of occurrences of any pattern P in T in time O(|P |+log logw σ) on a RAM machine of w = Ω(logn)-bit words. This new index outperforms all the other compressed indexes that can be bu...
متن کاملSpace-Efficient Construction of Compressed Indexes in Deterministic Linear Time
We show that the compressed suffix array and the compressed suffix tree of a string T can bebuilt in O(n) deterministic time using O(n log σ) bits of space, where n is the string length andσ is the alphabet size. Previously described deterministic algorithms either have a constructiontime that depends on the alphabet size or need ω(n log σ) bits of working space. ∗Cheriton School of...
متن کاملImproved Grammar-Based Compressed Indexes
We introduce the first grammar-compressed representation of a sequence that supports searches in time that depends only logarithmically on the size of the grammar. Given a text T [1..u] that is represented by a (context-free) grammar of n (terminal and nonterminal) symbols and size N (measured as the sum of the lengths of the right hands of the rules), a basic grammar-based representation of T ...
متن کاملParallel and Distributed Compressed Indexes
We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text, so that their size is a function of the compressed text size. Moreover, they support a considerable amount of functions, more than many classical indexes. We make use of this extended functionality to obtain, in a shared-memor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2021
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3426473